Smoothed analysis of belief propagation and minimum-cost flow algorithms
نویسنده
چکیده
Acknowledgments At the start of a Ph.D. project, you never know where it will take you. Though the research plan for my project contained several paragraphs on the planned research for the first two years, the plan for the last two years consisted of only a couple of lines. Even this concise plan turned out to be too detailed, since some research directions turned out to be less promising than expected, while other interesting research opportunities appeared. This thesis is the result of all the research that I did during the last four years. I look back at my time as a Ph.D. student as a very enjoyable time, during which I learned many new things. Many people contributed to this, and I would like to thank them here. First of all, I would like to thank my supervisors. Marc, thank you for giving me the opportunity to do research as a Ph.D. student in the DMMP group. Also, thank you for writing praising recommendation letters for me, which allowed me to participate in several interesting summer schools. Bodo, thank you for being my daily supervisor. It was a pleasure to be the first Ph.D. student under your supervision. Thank you for always having your door open for me and for coming to look for me when I would not visit you often enough. In addition, I am grateful for all the writing advice that you gave me to improve the quality of my papers. While at the University of Twente, I had the pleasure to get to know many colleagues from the DMMP, SOR, and 'floor 3' groups of applied mathematics. Thank you all for always being willing to discuss research with me. Also, thank you for the fun times we had both at work and outside of work. Among others, I really enjoyed our pub quizzes, escape rooms, movie nights, kart racing afternoons, department outings, and games and beer nights at the Lunteren conferences. Thank you in particular to Ruben and Jasper, who were my office mates for most of my stay in the DMMP group. I always enjoyed our conversations, both concerning work topics and other topics (mostly games). During my Ph.D. time I visited the University of Bonn several times. Heiko, Tobias, Clemens, and Michael, thank you for always making me feel welcome in Bonn and for the successful cooperation, from which two joint papers resulted. …
منابع مشابه
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
Belief propagation (BP) is a message-passing heuristic for statistical inference in graphical models such as Bayesian networks and Markov random fields. BP is used to compute marginal distributions or maximum likelihood assignments and has applications in many areas, including machine learning, image processing, and computer vision. However, the theoretical understanding of the performance of B...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملSmoothed Analysis of Selected Optimization Problems and Algorithms
Optimization problems arise in almost every field of economics, engineering, and science. Many of these problems are well-understood in theory and sophisticated algorithms exist to solve them efficiently in practice. Unfortunately, in many cases the theoretically most efficient algorithms perform poorly in practice. On the other hand, some algorithms are much faster than theory predicts. This d...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016